const github.com/klauspost/compress/flate.tableBits
57 uses
github.com/klauspost/compress/flate (current package)
fast_encoder.go#L38: tableBits = 15 // Bits used in the table
fast_encoder.go#L39: tableSize = 1 << tableBits // Size of the table
fast_encoder.go#L40: tableShift = 32 - tableBits // Right-shift to get the tableBits most significant bits of a uint32.
level1.go#L81: nextHash := hashLen(cv, tableBits, hashBytes)
level1.go#L90: nextHash = hashLen(now, tableBits, hashBytes)
level1.go#L204: e.table[hashLen(cv, tableBits, hashBytes)] = tableEntry{offset: s + e.cur}
level1.go#L217: prevHash := hashLen(x, tableBits, hashBytes)
level1.go#L220: currHash := hashLen(x, tableBits, hashBytes)
level4.go#L84: nextHashS := hashLen(cv, tableBits, hashShortBytes)
level4.go#L85: nextHashL := hash7(cv, tableBits)
level4.go#L109: lCandidate = e.bTable[hash7(next, tableBits)]
level4.go#L172: e.table[hashLen(cv, tableBits, hashShortBytes)] = tableEntry{offset: s + e.cur}
level4.go#L173: e.bTable[hash7(cv, tableBits)] = tableEntry{offset: s + e.cur}
level4.go#L185: e.bTable[hash7(cv, tableBits)] = t
level4.go#L186: e.bTable[hash7(cv>>8, tableBits)] = t2
level4.go#L187: e.table[hashLen(cv>>8, tableBits, hashShortBytes)] = t2
level4.go#L194: e.bTable[hash7(cv, tableBits)] = t
level4.go#L195: e.bTable[hash7(cv>>8, tableBits)] = t2
level4.go#L196: e.table[hashLen(cv>>8, tableBits, hashShortBytes)] = t2
level4.go#L205: prevHashS := hashLen(x, tableBits, hashShortBytes)
level4.go#L206: prevHashL := hash7(x, tableBits)
level5.go#L92: nextHashS := hashLen(cv, tableBits, hashShortBytes)
level5.go#L93: nextHashL := hash7(cv, tableBits)
level5.go#L109: nextHashS = hashLen(next, tableBits, hashShortBytes)
level5.go#L110: nextHashL = hash7(next, tableBits)
level5.go#L201: eLong := e.bTable[hash7(load6432(src, sAt), tableBits)].Cur.offset
level5.go#L261: e.table[hashLen(cv, tableBits, hashShortBytes)] = t
level5.go#L262: eLong := &e.bTable[hash7(cv, tableBits)]
level5.go#L268: eLong = &e.bTable[hash7(cv, tableBits)]
level5.go#L274: e.table[hashLen(cv, tableBits, hashShortBytes)] = t
level5.go#L282: eLong := &e.bTable[hash7(cv, tableBits)]
level5.go#L284: e.table[hashLen(cv>>8, tableBits, hashShortBytes)] = t2
level5.go#L293: prevHashS := hashLen(x, tableBits, hashShortBytes)
level5.go#L294: prevHashL := hash7(x, tableBits)
level5.go#L404: nextHashS := hashLen(cv, tableBits, hashShortBytes)
level5.go#L405: nextHashL := hash7(cv, tableBits)
level5.go#L421: nextHashS = hashLen(next, tableBits, hashShortBytes)
level5.go#L422: nextHashL = hash7(next, tableBits)
level5.go#L513: eLong := e.bTable[hash7(load6432(src, sAt), tableBits)].Cur.offset
level5.go#L573: e.table[hashLen(cv, tableBits, hashShortBytes)] = t
level5.go#L574: eLong := &e.bTable[hash7(cv, tableBits)]
level5.go#L580: eLong = &e.bTable[hash7(cv, tableBits)]
level5.go#L586: e.table[hashLen(cv, tableBits, hashShortBytes)] = t
level5.go#L594: eLong := &e.bTable[hash7(cv, tableBits)]
level5.go#L596: e.table[hashLen(cv>>8, tableBits, hashShortBytes)] = t2
level5.go#L605: prevHashS := hashLen(x, tableBits, hashShortBytes)
level5.go#L606: prevHashL := hash7(x, tableBits)
level6.go#L94: nextHashS := hashLen(cv, tableBits, hashShortBytes)
level6.go#L95: nextHashL := hash7(cv, tableBits)
level6.go#L111: nextHashS = hashLen(next, tableBits, hashShortBytes)
level6.go#L112: nextHashL = hash7(next, tableBits)
level6.go#L223: eLong := &e.bTable[hash7(load6432(src, sAt), tableBits)]
level6.go#L290: e.table[hashLen(cv, tableBits, hashShortBytes)] = tableEntry{offset: i + e.cur}
level6.go#L291: eLong := &e.bTable[hash7(cv, tableBits)]
level6.go#L303: eLong := &e.bTable[hash7(cv, tableBits)]
level6.go#L304: eLong2 := &e.bTable[hash7(cv>>8, tableBits)]
level6.go#L305: e.table[hashLen(cv, tableBits, hashShortBytes)] = t
|
The pages are generated with Golds v0.6.7. (GOOS=linux GOARCH=amd64)
Golds is a Go 101 project developed by Tapir Liu.
PR and bug reports are welcome and can be submitted to the issue list.
Please follow @Go100and1 (reachable from the left QR code) to get the latest news of Golds. |